-
-
Notifications
You must be signed in to change notification settings - Fork 480
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Overwrote methods concerning loops for a matching covered graph #38955
base: develop
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think you added too many doctests. Do we really need to tests all the methods in the tests of all methods ?
Oh. |
Documentation preview for this PR (built with commit d8beed1; changes) is ready! 🎉 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM.
Hi, |
Yes, it would be much better. I'm setting back this PR to needs review then. |
The objective of this issue is to overwrite the methods pertaining to loops for a matching covered graph.
More specifically, this PR aims to implement/ update the following methods:
allow_loops()
: Change whether loops are allowed in (matching covered) graphs.allows_loops()
: Return whether loops are permitted in (matching covered) graphs.has_loops()
: Check whether thare are loops in the (matching covered) graph.loop_edges()
: Return a list of all loops in the (matching covered) graph.loop_vertices()
: Return a list of vertices with loops.loops()
: Return a list of all loops in the (matching covered) graph.number_of_loops()
: Return the number of edges that are loops.remove_loops()
: Remove loops on vertices invertices
.This PR shall address the methods related to loops for matching covered graphs.
Fixes #38216. Note that this issue fixes a small part of the mentioned issue.
This PR depends on the PR #38742.
📝 Checklist
⌛ Dependencies
Nothing as of now (up to my knowledge).
cc: @dcoudert.